KERALA UNIVERSITY Class 6 design and analysis of algorthims Question Paper 2013

Practice authentic previous year questions for better exam preparation.

Sample Questions

What is recurrence relation? solve the recurrence relation $T(n)=2 T(n / 2)+n$ using substitution.
What is space complexity? What is its importance?
What is a B Tree? Explain with an Example.
Write the algorithm for DFS traversal? Demonstrate its working with an example.
Explain the complexity classes NP and NP Hard in detail. Name a problem which belongs to each these classes. ( $5 \times 4=20$ Marks) PART - B Answer one question completely from each module